@article{AbouelhodaKurtzOhlenbusch,
  title={Replacing suffix trees with enhanced suffix arrays},
  author={Abouelhoda, M. I. and Kurtz, S. and Ohlebusch, E.},
  journal={Journal of Discrete Algorithms},
  volume={2},
  number={1},
  pages={53--86},
  year={2004},
  publisher={Elsevier}
}
@article{AhoHirschbergUllman,
  title={Bounds on the complexity of the longest common subsequence problem},
  author={Ullman, J. D. and Aho, A. V. and Hirschberg, D. S.},
  journal={Journal of the ACM (JACM)},
  volume={23},
  number={1},
  pages={1--12},
  year={1976},
  publisher={ACM}
}
@inproceedings{BadkobehCrochemoreToopsuwan,
  title={Computing the maximal-exponent repeats of an overlap-free string in linear time},
  author={Badkobeh, G. and Crochemore, M. and Toopsuwan, C.},
  booktitle={String Processing and Information Retrieval},
  pages={61--72},
  year={2012},
  organization={Springer}
}
@article{BannaiIInenagaNakashimaTakedaTsuruta,
  title={The ``runs'' theorem},
  author={Bannai, H. and I, T. and Inenaga, S. and Nakashima, Y. and Takeda, M. and Tsuruta, K.},
  journal={arXiv preprint arXiv:1406.0263v4},
  year={2014}
}
@PHDTHESIS{Breslauer,
  author = {Breslauer, D.},
  title = {Efficient string algorithmics},
  school = {Columbia University}
  year = {1992}
}
@article{ChenPuglisiSmyth,
  title={Lempel--Ziv factorization using less time \& space},
  author={Chen, G. and Puglisi, S. J. and Smyth, W. F.},
  journal={Mathematics in Computer Science},
  volume={1},
  number={4},
  pages={605--623},
  year={2008},
  publisher={Springer}
}
@article{Crochemore,
  title={Transducers and repetitions},
  author={Crochemore, M.},
  journal={Theoretical Computer Science},
  volume={45},
  pages={63--86},
  year={1986},
  publisher={Elsevier}
}
@inproceedings{CrochemoreIlieSmyth,
  title={A simple algorithm for computing the Lempel-Ziv factorization},
  author={Crochemore, M. and Ilie, L. and Smyth, W. F.},
  booktitle={Data Compression Conference (DCC'08)},
  pages={482--488},
  year={2008},
  organization={IEEE}
}
@article{CrochemoreIlieTinta,
  title={The ``runs'' conjecture},
  author={Crochemore, M. and Ilie, L. and Tinta, L.},
  journal={Theoretical Computer Science},
  volume={412},
  number={27},
  pages={2931--2941},
  year={2011},
  publisher={Elsevier}
}
@article{CKRRW,
  title={On the maximal sum of exponents of runs in a string},
  author={Crochemore, M. and Kubica, M. and Radoszewski, J. and Rytter, W. and Wale{\'n}, T.},
  journal={Journal of Discrete Algorithms},
  volume={14},
  pages={29--36},
  year={2012},
  publisher={Elsevier}
}
@article{EvenPrattRodeh,
  title={Linear algorithm for data compression via string matching},
  author={Rodeh, M. and Pratt, V. R. and Even, S.},
  journal={Journal of the ACM (JACM)},
  volume={28},
  number={1},
  pages={16--24},
  year={1981},
  publisher={ACM}
}
@article{FialaGreene,
  title={Data compression with finite windows},
  author={Fiala, E. R. and Greene, D. H.},
  journal={Communications of the ACM},
  volume={32},
  number={4},
  pages={490--505},
  year={1989},
  publisher={ACM}
}
@article{FineWilf,
  title={Uniqueness theorems for periodic functions},
  author={Fine, N. J. and Wilf, H. S.},
  journal={Proceedings of the American Mathematical Society},
  volume={16},
  number={1},
  pages={109--114},
  year={1965},
  publisher={JSTOR}
}
@inproceedings{KarkkainenKempaPuglisi,
  title={Lempel-Ziv parsing in external memory},
  author={Karkkainen, J. and Kempa, D. and Puglisi, S. J.},
  booktitle={Data Compression Conference (DCC'14)},
  pages={153--162},
  year={2014},
  organization={IEEE}
}
@article{Kolpakov,
  title={On primary and secondary repetitions in words},
  author={Kolpakov, R.},
  journal={Theoretical Computer Science},
  volume={418},
  pages={71--81},
  year={2012},
  publisher={Elsevier}
}
@inproceedings{KolpakovKucherov,
  title={Finding maximal repetitions in a word in linear time},
  author={Kolpakov, R. and Kucherov, G.},
  booktitle={40th Annual Symposium on Foundations of Computer Science},
  pages={596--604},
  year={1999},
  organization={IEEE}
}
@inproceedings{KolpakovPodolskiyPosypkinKhrapov,
  title={Searching of gapped repeats and subrepetitions in a word},
  author={Kolpakov, R. and Podolskiy, M. and Posypkin, M. and Khrapov, N.},
  booktitle={Combinatorial Pattern Matching},
  pages={212--221},
  year={2014},
  organization={Springer}
}
@article{LempelZiv,
  title={On the complexity of finite sequences},
  author={Lempel, A. and Ziv, J.},
  journal={Information Theory, IEEE Transactions on},
  volume={22},
  number={1},
  pages={75--81},
  year={1976},
  publisher={IEEE}
}
@article{Main,
  title={Detecting leftmost maximal periodicities},
  author={Main, M. G.},
  journal={Discrete Applied Mathematics},
  volume={25},
  number={1},
  pages={145--153},
  year={1989},
  publisher={Elsevier}
}
@incollection{MainLorentz,
  title={Linear time recognition of squarefree strings},
  author={Main, M. G. and Lorentz, R. J.},
  booktitle={Combinatorial Algorithms on Words},
  pages={271--278},
  year={1985},
  publisher={Springer}
}
@incollection{OkanoharaSadakane,
  title={An online algorithm for finding the longest previous factors},
  author={Okanohara, D. and Sadakane, K.},
  booktitle={Algorithms-ESA 2008},
  pages={696--707},
  year={2008},
  publisher={Springer}
}
@incollection{Starikovskaya,
  title={Computing lempel-ziv factorization online},
  author={Starikovskaya, T.},
  booktitle={Mathematical Foundations of Computer Science 2012},
  pages={789--799},
  year={2012},
  publisher={Springer}
}
@article{YamamotoIBannaiEtal,
  title={Faster compact on-line Lempel-Ziv factorization},
  author={Yamamoto, J. and Bannai, H. and Inenaga, S. and Takeda, M.},
  journal={arXiv preprint arXiv:1305.6095v1},
  year={2013}
}
